Light-Weight SMT-based Model Checking

Light-Weight SMT-based Model Checking

Recently, the notion of an array-based system has been introduced as an abstraction of infinite state sys-tems (such as mutual exclusion protocols or sorting programs) which allows for model checking of invariant(safety) and recurrence (liveness) properties by Satisfiability Modulo Theories (SMT) techniques. Unfortu-nately, the use of quantified first-order formulae to describe sets...

SMT-Based Model Checking

SMT-Based Model Checking for Recursive Programs

We present an SMT-based symbolic model checking algorithm for safety verification of recursive programs. The algorithm is modular and analyzes procedures individually. Unlike other SMT-based approaches, it maintains both overand under-approximations of procedure summaries. Under-approximations are used to analyze procedure calls without inlining. Over-approximations are used to block infeasible...

Towards SMT Model Checking of Array-Based Systems

We introduce the notion of array-based system as a suitable abstraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-first order formulae to symbolically represent array-based systems, we propose methods to check safety (invariance) and liveness (recurrence) properties on top of Satisfiability Modulo Theories solvers. We find hypothes...

SMT-based Symbolic Model Checking for Multi-Threaded Programs

Today, hyper-threading and multi-core hardware have become ubiquitous, putting us at a fundamental turning point in software development. In order for software applications to benefit from the continued exponential throughput advances in multi-core processors, applications will need to be multi-threaded software programs that are highly reliable. However, multi-threaded programs are notoriously...